Minimum Total Communication Power Connected Dominating Set in Wireless Networks

A virtual backbone of a wireless network is a connected subset of nodes responsible for routing messages in the network. A node in the subset is likely to be exhausted much faster than the others due to its heavy duties. This situation can be more aggravated if the node uses higher communication power to form the virtual backbone. In this paper, we introduce the minimum total communication power connected dominating set (MTCPCDS) problem, whose goal is to compute a virtual backbone with minimum total communication power. We show this problem is NP-hard and propose two distributed algorithms. Especially, the first algorithm, MST-MTCPCDS, has a worst case performance guarantee. A simulations is conducted to evaluate the performance of our algorithms.